Quantum guessing via Deutsch-Jozsa

3 Quantum Guessing via Deutsch - Jozsa

We examine the “Guessing Secrets” problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN3) steps to produce the answer. In showing the possibilities of ...

J an 2 00 3 Quantum Guessing via Deutsch - Jozsa

We begin with a variation of classical 20 questions and propose a quantum algorithm to solve it efficiently and in time independent of the size of the object set. In the process, we extend the types of questions and function oracles that the Deutsch-Jozsa algorithm can be used to solve.

A different Deutsch-Jozsa

A Generalization of the Deutsch-jozsa Quantum Algorithm

A quantum algorithm is presented that can be used to distinguish between certain classes of functions on a finite abelian group. The algorithm is patterned after and generalizes one due to Deutsch and Jozsa for distinguishing a constant function from a balanced function on a direct sum of copies of the integers modulo two. The Deutsch-Jozsa algorithm is a quantum algorithm for distinguishing be...

Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack ...